On problems without polynomial kernels
نویسندگان
چکیده
Kernelization is a central technique used in parameterized algorithms, and in other techniques for coping with NP-hard problems. In this paper, we introduce a new method which allows us to show that many problems do not have polynomial size kernels under reasonable complexity-theoretic assumptions. These problems include kPath, k-Cycle, k-Exact Cycle, k-Short Cheap Tour, k-Graph Minor Order Test, k-Cutwidth, k-Search Number, k-Pathwidth, k-Treewidth, k-Branchwidth, and several optimization problems parameterized by treewidth or cliquewidth.
منابع مشابه
An Effective Numerical Technique for Solving Second Order Linear Two-Point Boundary Value Problems with Deviating Argument
Based on reproducing kernel theory, an effective numerical technique is proposed for solving second order linear two-point boundary value problems with deviating argument. In this method, reproducing kernels with Chebyshev polynomial form are used (C-RKM). The convergence and an error estimation of the method are discussed. The efficiency and the accuracy of the method is demonstrated on some n...
متن کاملEvaluation of Sentinel-1 Interferometric SAR Coherence efficiency for Land Cover Mapping
In this study, the capabilities of Interferometric Synthetic Aperture Radar (InSAR) time series data and machine learning have been evaluated for land cover mapping in Iran. In this way, a time series of Sentinel-1 SAR data (including 16 SLC images with approximately 24 days time interval) from 2018 to 2020 were used for a region of Ahvaz County located in Khuzestan province. Using InSAR proces...
متن کاملLearning the Kernel for Classification and Regression
We investigate a series of learning kernel problems with polynomial combinations of base kernels, which will help us solve regression and classification problems. We also perform some numerical experiments of polynomial kernels with regression and classification tasks on different datasets.
متن کاملPolynomial kernels collapse the W-hierarchy
We prove that, for many parameterized problems in the class FPT, the existence of polynomial kernels implies the collapse of the Whierarchy (i.e., W[P] = FPT). The collapsing results are also extended to assumed exponential kernels for problems in the class FPT. In particular, we establish a close relationship between polynomial (and exponential) kernelizability and the existence of sub-exponen...
متن کاملDiminishable Parameterized Problems and Strict Polynomial Kernelization
Kernelization—a mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems—plays a central role in parameterized complexity and has triggered an extensive line of research. This is in part due to a lower bounds framework that allows to exclude polynomial-size kernels under the assumption of NP * coNP/poly. In this paper we consider a restricted yet natural...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 75 شماره
صفحات -
تاریخ انتشار 2009